Probabilistic analysis of algorithms - PDFSEARCH.IO - Document Search Engine

Probabilistic analysis of algorithms
Results: 137

#	Item
71	CALL FOR PAPERS ANALYSIS OF ALGORITHMS Special Issue in Algorithmica Average-Case Analysis of Algorithms is the area of Theoretical Computer Science that studies the behavior of algorithms on random inputs. The focus is Add to Reading List Source URL: algo.inria.fr Language: English - Date: 2004-11-13 12:22:28 Computer science Mathematics Probabilistic analysis of algorithms Algorithm Randomized algorithm Best worst and average case Combinatorics Amortized analysis Analysis of algorithms Applied mathematics Probabilistic complexity theory
72	SIAM J. COMPUT. Vol. 34, No. 4, pp. 848–862 c 2005 Society for Industrial and Applied Mathematics Add to Reading List Source URL: www.cs.ucy.ac.cy Language: English - Date: 2007-11-27 04:33:40 Analysis of algorithms Probabilistic complexity theory Randomized algorithm Directed acyclic graph Algorithm Distributed computing Computer architecture Cellular neural network Applied mathematics Theoretical computer science Mathematics
73	Meeting the Deadline: On the Complexity of Fault-Tolerant Continuous Gossip∗ Chryssis Georgiou† Seth Gilbert‡ Add to Reading List Source URL: www.cs.ucy.ac.cy Language: English - Date: 2011-10-13 04:45:49 Analysis of algorithms Complexity classes Human communication Probabilistic complexity theory Gossip protocol Consensus Adversary model Randomized algorithm Distributed computing Theoretical computer science Computational complexity theory Applied mathematics
74	Computational Complexity and Information Asymmetry in Election Audits with Low-Entropy Randomness Nadia Heninger Princeton University [removed] Add to Reading List Source URL: www.cis.upenn.edu Language: English - Date: 2010-06-24 00:55:06 Probabilistic complexity theory Randomized algorithm Graph Expander graph Connectivity Probabilistic method Neighbourhood Extractor Pseudoforest Graph theory Mathematics Analysis of algorithms
75	Low-distortion Subspace Embeddings in Input-sparsity Time and Applications to Robust Linear Regression Xiangrui Meng∗ Michael W. Mahoney Add to Reading List Source URL: www.stat.berkeley.edu Language: English - Date: 2014-06-25 12:32:40 Analysis of algorithms Probabilistic complexity theory Randomized algorithm Projection Embedding Time complexity NC Regression analysis Theoretical computer science Computational complexity theory Mathematics
76	WHAT DO WE KNOW ABOUT THE PRODUCT REPLACEMENT ALGORITHM? Igor Pak Department of Mathematics Yale University Add to Reading List Source URL: www.math.ucla.edu Language: English - Date: 2009-09-18 14:18:06 Probabilistic complexity theory Analysis of algorithms Randomized algorithm Random walk Markov chain Order statistic Permutation Sylow theorems Word problem for groups Mathematics Abstract algebra Algebra
77	Space-efficient Local Computation Algorithms∗ Noga Alon† Ronitt Rubinfeld‡ Abstract Add to Reading List Source URL: www.math.tau.ac.il Language: English - Date: 2011-10-02 19:00:10 Network theory Analysis of algorithms Probabilistic complexity theory Randomized algorithm Graph coloring Decision tree model Probabilistic method Algorithm Shortest path problem Theoretical computer science Mathematics Applied mathematics
78	ANYTIME ALGORITHMS FOR ROBDD SYMMETRY DETECTION AND APPROXIMATION a thesis submitted to The University of Kent at Canterbury in the subject of computer science Add to Reading List Source URL: www.digit-labs.org Language: English - Date: 2008-09-04 12:58:00 Analysis of algorithms Symmetry Probabilistic complexity theory Algorithm Approximation algorithm Anytime algorithm Time complexity Randomized algorithm Theoretical computer science Applied mathematics Computational complexity theory
79	A Randomized Algorithm for Multiselection M. H. Alsuwaiyel Department of Information and Computer Science King Fahd University of Petroleum & Minerals Dhahran 31261, Saudi Arabia e-mail: [removed] Add to Reading List Source URL: eprints.kfupm.edu.sa Language: English - Date: 2011-04-06 05:04:59 Analysis of algorithms Sorting algorithms Probabilistic complexity theory Randomized algorithm Quicksort Selection algorithm Algorithm Time complexity Computational complexity theory Theoretical computer science Mathematics Applied mathematics
80	09391 Abstracts Collection Algorithms and Complexity for Continuous Problems Dagstuhl Seminar 1 Add to Reading List Source URL: drops.dagstuhl.de Language: English - Date: 2009-12-02 02:56:23 Computational complexity theory Probabilistic complexity theory Monte Carlo methods Joseph F. Traub Analysis of algorithms Markov models Randomized algorithm Algorithm Mathematical optimization Theoretical computer science Applied mathematics Mathematics

UPDATE